Refinements of Restricted Higher-Order Anti-Unification for Heuristic-Driven Theory Projection
نویسندگان
چکیده
Acknowledgements First, i would like to thank my supervisors Angela Schwering and Kai-Uwe Kühn-berger for their valuable advice and support. Furthermore, i credit Helmar Gust and Ulf Krumnack for helpful discussions about the formal topics involved. Additionally, my gratitude goes to Egon Stemle and Jackie Griego for their help to typeset and proofread this thesis.
منابع مشابه
Ontological Aspects of Computing Analogies
In AI, there is an increasing interest in examining ontologies for a variety of applications. Classical ontologies can have different forms ranging from lattice-like structures (Ganter & Wille, 1996) to less restricted semantic networks (Peters & Shrobe, 2003). Analogical reasoning has a long tradition in cognitive science and AI. The monograph Gentner, Holyoak & Kokinov (2001) is a good summar...
متن کاملMathematical reasoning with higher-order anti-unifcation
We show how heuristic-driven theory projection (HDTP, a method based on higher-order anti-unification) can be used to model analogical reasoning in mathematics. More precisely, HDTP provides the framework for a model of the inductive analogy-making process involved in establishing the fundamental concepts of arithmetic. This process is a crucial component for being able to generalise from the c...
متن کاملOn the Logical Formalization of Analogies and Theory Blending in the HDTP Framework
Analogies are considered a cognitive core mechanism, that is applied in many everday reasoning processes. Heuristic-driven theory projection (HDTP) is a logic-based framework that allows to model analogies with the aim of making analogical reasoning techniques available for artificial intelligence systems. The formal properties of HDTP are investigated, refining and extending some of the origin...
متن کاملPattern Unification for the Lambda Calculus with Linear and Affine Types
Logic programming languages, type inference algorithms, and automated theorem provers are all examples of systems that rely on unification. If the unification problem has to deal with logic variables at higher type (functional type), we speak of higher-order unification [4]. Higher-order unification is in general undecidable, but it can be turned decidable, if appropriately restricted to a frag...
متن کاملComplex Analogies: Remarks on the Complexity of HDTP
After an introduction to Heuristic-Driven Theory Projection (HDTP) as framework for computational analogy-making, and a compact primer on parametrized complexity theory, we provide a complexity analysis of the key mechanisms underlying HDTP, together with a short discussion of and reflection on the obtained results. Amongst others, we show that restricted higher-order antiunification as current...
متن کامل